On equitable zero sums
نویسنده
چکیده
There is a rich literature on conditions guaranteeing that certain sums of residue classes cover certain other residue classes modulo some integer N . Often it is of particular importance for applications to know that the class 0 mod N can be represented as a sum of the studied residue classes, and the zero class is often the most difficult case. A well-known result along these lines is the famous Erdős-Ginzburg-Ziv theorem, which says that any sequence of 2N − 1 integers contains a subsequence of N integers whose sum is zero; furthermore, the example of N − 1 copies of 0 and N − 1 copies of 1 shows that all residue classes, except the zero class, can be represented if the sequence were only of length 2N − 2. In the study of sums of distinct residue classes modulo N (for example, the work of Olson [3]), the example a1 = 1, . . . , ar = r, with r = √ 4N − 1, shows that again the zero residue class is the most difficult to represent.
منابع مشابه
The Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables
In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...
متن کاملA Short Proof of the Hajnal-Szemerédi Theorem on Equitable Coloring
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ in size by at most one. Equitable colorings naturally arise in some scheduling, partitioning, and load balancing problems [1, 15, 16]. Pemmaraju [13] and Janson and Ruciński [6] used equitable colorings to derive deviation bounds for sums of dependent random variables that exhibit limited depende...
متن کاملA Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring
An equitable k-colouring of a graph G is a proper k-colouring, for which any two colour classes differ in size by at most one. Equitable colourings naturally arise in some scheduling, partitioning, and load-balancing problems [1, 15, 16]. Pemmaraju [13] and Janson and Ruciński [6] used equitable colourings to derive deviation bounds for sums of random variables that exhibit limited dependence. ...
متن کاملDeterminants of Certain Classes of Zero-One Matrices with Equal Line Sums
We study the possible determinant values of various classes of n×n zero-one matrices with fixed row and column sums. Some new results, open problems, and conjectures are presented.
متن کاملOn the Existence of Sequences and Matrices With Prescribed Partial Sums of Elements
We prove necessary and sufficient conditions for the existence of sequences and matrices with elements in given intervals and with prescribed lower and upper bounds on the element sums corresponding to the sets of an orthogonal pair of partitions. We use these conditions to generalize known results on the existence of nonnegative matrices with a given zero pattern and prescribed row and column ...
متن کامل